A Benchmark Data Set for Data Association

نویسندگان

  • Jörg Kurlbaum
  • Udo Frese
  • Thomas Barkowsky
چکیده

In this technical report we present a data set which can be used by researchers to test and compare their algorithms related to feature-based SLAM and in particular data association tasks. The data set covers a large path mostly through an indoor office environment with artificial and natural landmarks. It provides odometry and geometrical results from computer vision-based landmark detection, as well as raw images and camera calibration data. The artificial landmarks are white discs on the floor where the position relative to the robot is provided as measurement. The natural landmarks are vertical lines where only the bearing relative to the robot is provided and data association is remarkably difficult. This technical report provides full information about experimental setup, model and measurement functions. The focus of this data set is on data association and for comparison of different approaches we provide full ground truth by annotating all features.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

presentation of a two stages method to determine the suitable benchmark and return to scale (case study: girls high school of one zone shiraz city)

In this paper, a two stages method to determine suitable benchmark and return scale of the decision making units set is presented. At first, all of the efficient reference set in no radial data envelopment analysis (DEA) based on linear programming is found. first, RAM model is introduced and units is investigated using this model, then, to run the given algorithm below steps is performed. At t...

متن کامل

RANKING DMUS ON THE BENCHMARK LINE WITH EQUAL SHADOW PRICES

Data envelopment analysis (DEA) with considering the best condition for each decision making unit (DMU) assesses the relative efficiency for it and divides a homogenous group of DMUs in to two categories: efficient and inefficient, but traditional DEA models can not rank efficient DMUs. Although some models were introduced for ranking efficient DMUs, Franklin Lio & Hsuan peng (2008), proposed a...

متن کامل

Using a Data Mining Tool and FP-Growth Algorithm Application for Extraction of the Rules in two Different Dataset (TECHNICAL NOTE)

In this paper, we want to improve association rules in order to be used in recommenders. Recommender systems present a method to create the personalized offers. One of the most important types of recommender systems is the collaborative filtering that deals with data mining in user information and offering them the appropriate item. Among the data mining methods, finding frequent item sets and ...

متن کامل

Deep Data Anaylizing Application Based on Scale Space Theory in Big Data Environment

This paper introduces the basic scientific idea of the multi-scale to the field of big data analyzes, proposes a multi-scale framework of data analyzes in big data environment, present the multi-scale algorithm framework of knowledge conversion theory and apply the algorithm framework to the multi dimension association rules analysis. The proposed multi-scale association rule analysis algorithm...

متن کامل

A Method for Target Setting with Share Data

Data Envelopment Analysis (DEA) is a mathematical programming technique for evaluatingthe relative efficiency of a set of Decision Making Units (DMUs) and can also be utilized forsetting target. Target setting is one of the important subjects since according to its resultsefficiency can be increased. An important issue to be currently discussed, is to set targetwhile considering share data. The...

متن کامل

Finding a suitable benchmark for commercial bank branches using DEA

  This paper proposes a suitable benchmark for inefficient commercial bank branches by using Data Envelopment Analysis (DEA). In order to render an inefficient bank branch efficient, it is necessary to decrease inputs and increase outputs. As there are priorities for decreasing some certain inputs and increasing some certain outputs over other inputs and outputs, respectively, it is necessary ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008